Combinatorics of Fulton's Essential Set

نویسنده

  • KIMMO ERIKSSON
چکیده

Fulton introduced the essential set of a permutation, together with a rank function. In this paper we study some combinatorial aspects of the essential set: We present an algorithm that retrieves a permutation from its ranked essential set. Thereby we can characterize the class of ranked sets that arise as ranked essential sets of permutations, answering a question of Fulton. Several classes of permutations are characterized in terms of their essential set. Results in higher dimensions are discussed. 1. Introduction An n by n permutation matrix can be represented by an n by n array of squares with one dot in each row and column and all other squares empty. The diagram of a permutation matrix (deened in 1800 by Rothe) is obtained by shading every row from the dot and eastwards and shading every column from the dot and southwards. The essential set is the set of southeast corners of the connected components of the diagram. The essential set, together with a rank function, was introduced by Fulton 7] in a pioneering paper from 1992, in order to study the irreducible loci in spaces of matrices. Though in the present paper we are not going to pursue this geometric issue much but rather concentrate on the essential set per se, we need a short recollection of the background. Fulton studies varieties given by ideals of minors, subject to certain rank conditions , in a generic matrix. One concern is, given a prescribed rank function r(i; j), to determine if there exist matrices such that the rank of the upper left i by j subma-trices is r(i; j) for every position (i; j). He observes that if such matrices exist, then there is in particular some permutation matrix with this property, so it is enough to consider permutation matrices. More generally, he is interested in prescribing the ranks only for a few of the submatrices, such that all the other ranks follow from these. In other words, nd a subset of the upper left submatrices of a permutation matrix such that the permutation is uniquely determined by their ranks. Fulton

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The sum-annihilating essential ideal graph of a commutative ring

Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$is called an annihilating ideal if there exists $rin Rsetminus {0}$ such that $Ir=(0)$ and an ideal $I$ of$R$ is called an essential ideal if $I$ has non-zero intersectionwith every other non-zero ideal of $R$. Thesum-annihilating essential ideal graph of $R$, denoted by $mathcal{AE}_R$, isa graph whose vertex set is the set...

متن کامل

Ubiquity of Kostka Polynomials

We report about results revolving around Kostka–Foulkes and parabolic Kostka polynomials and their connections with Representation Theory and Combinatorics. It appears that the set of all parabolic Kostka polynomials forms a semigroup, which we call Liskova semigroup. We show that polynomials frequently appearing in Representation Theory and Combinatorics belong to the Liskova semigroup. Among ...

متن کامل

The size of Fulton's essential set

The essential set of a permutation was defined by Fulton as the set of southeast corners of the diagram of the permutation. In this paper we determine explicit formulas for the average size of the essential set in the two cases of arbitrary permutations in Sn and 321-avoiding permutations in Sn. Vexillary permutations are discussed too. We also prove that the generalized Catalan numbers (r+k−1 ...

متن کامل

The Order Steps of an Analytic Combinatorics

‎Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures‎. ‎This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines‎, ‎including probability theory‎, ‎statistical physics‎, ‎computational biology and information theory‎. ‎With a caref...

متن کامل

More Combinatorics of Fulton’s Essential Set

Abstract We develop combinatorics of Fulton’s essential set particularly with a connection to Baxter permutations. For this purpose, we introduce a new idea: dual essential sets. Together with the original essential set, we reinterpret Eriksson-Linusson’s characterization of Baxter permutations in terms of colored diagrams on a square board. We also discuss a combinatorial structure on local mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995